Coloured Permutations Containing and Avoiding Certain Patterns

نویسنده

  • TOUFIK MANSOUR
چکیده

Following [M2], let S (r) n be the set of all coloured permutations on the symbols 1, 2, . . . , n with colours 1, 2, . . . , r, which is the analogous of the symmetric group when r = 1, and the hyperoctahedral group when r = 2. Let I ⊆ {1, 2, . . . , r} be subset of d colours; we define T k,r(I) be the set of all coloured permutations φ ∈ S (r) k such that φ1 = m (c) where c ∈ I. We prove that, the number T k,r(I)avoiding coloured permutations in S (r) n equals (k−1)!r ∏n j=k hj for n ≥ k where hj = (r−d)j+(k−1)d. We then prove that for any φ ∈ T 1 k,r(I) (or any φ ∈ T k k,r(I)), the number of coloured permutations in S (r) n which avoid all patterns in T 1 k,r(I) (or in T k k,r(I)) except for φ and contain φ exactly once equals ∏n j=k hj · ∑n j=k 1 hj for n ≥ k. Finally, for any φ ∈ T k,r(I), 2 ≤ m ≤ k − 1, this number equals ∏n j=k+1 hj for n ≥ k+1. These results generalize recent results due to Mansour [M1], and due to Simion [S].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Combinatorics Related to Central Binomial Coefficients: Grand-Dyck Paths, Coloured Noncrossing Partitions and Signed Pattern Avoiding Permutations

We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations. Next we transfer a natural distributive lattice structure on Grand-Dyck paths to coloured noncrossing partitions and signed pattern avoiding permutations, thus...

متن کامل

Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials

Several authors have examined connections among 132-avoiding permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we find analogues for some of these results for permutations π avoiding 132 and 1223 (there is no occurrence πi < πj < πj+1 such that 1 ≤ i ≤ j − 2) and provide a combinatorial interpretation for such permutations in terms of lattice paths. ...

متن کامل

Pattern Avoidance in Coloured Permutations

Let Sn be the symmetric group, Cr the cyclic group of order r, and let S (r) n be the wreath product of Sn and Cr; which is the set of all coloured permutations on the symbols 1, 2, . . . , n with colours 1, 2, . . . , r, which is the analogous of the symmetric group when r = 1, and the hyperoctahedral group when r = 2. We prove, for every 2letter coloured pattern φ ∈ S 2 , that the number of φ...

متن کامل

Permutations containing and avoiding certain patterns

Let T k = {σ ∈ Sk | σ1 = m}. We prove that the number of permutations which avoid all patterns in T k equals (k − 2)!(k − 1) n+1−k for k ≤ n. We then prove that for any τ ∈ T 1 k (or any τ ∈ T k k ), the number of permutations which avoid all patterns in T 1 k (or in T k k ) except for τ and contain τ exactly once equals (n + 1 − k)(k − 1)n−k for k ≤ n. Finally, for any τ ∈ T k , 2 ≤ m ≤ k − 1,...

متن کامل

Restricted Dumont permutations, Dyck paths, and noncrossing partitions

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001